Track Matching by Major Color Histograms Matching and Post-matching Integration

نویسندگان

  • Eric Dahai Cheng
  • Massimo Piccardi
چکیده

In this paper we present a track matching algorithm based on the “major color” histograms matching and the post-matching integration useful for tracking a single object across multiple, limitedly disjoint cameras. First, the Major Color Spectrum Histogram (MCSH) is introduced to represent a moving object in a single frame by its most frequent colors only. Then, a twodirectional similarity measurement based on the MCHS is used to measure the similarity of any two given moving objects in single frames. Finally, our track matching algorithm extends the single-frame matching along the objects’ tracks by a post-matching integration algorithm. Experimental results presented in this paper show the accuracy of the proposed track matching algorithm: the similarity of two tracks from the same moving objects has proved as high as 95%, while the similarity of two tracks from different moving objects has been kept as low as up to 28%. The postmatching integration step proves able to remove detailed errors occurring at the frame level, thus making track matching more robust and reliable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disjoint Camera Track Matching by an Illumination Effects Reduction and Major Colour Spectrum Histograms Representation Algorithms

In this paper we present a disjoint camera track matching algorithm based on a “cumulative colour histogram transformation”, the “major colour” histograms matching and the post-matching integration algorithms. In order to reduce the “effects of variable illuminations” in disjoint camera environment, a cumulative colour histogram transformation is applied to located moving object image first. Th...

متن کامل

Color scene transform between images using Rosenfeld-Kak histogram matching method

In digital color imaging, it is of interest to transform the color scene of an image to the other. Some attempts have been done in this case using, for example, lαβ color space, principal component analysis and recently histogram rescaling method. In this research, a novel method is proposed based on the Resenfeld and Kak histogram matching algorithm. It is suggested that to transform the color...

متن کامل

Instrument dependency of Kubelka-Munk theory in computer color matching

Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...

متن کامل

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

Color Matching of Blends Prepared From Black and White Fibers by Neural Networks (TECHNICAL NOTE)

The color of the blends of pre-colored fibers depends on the ratio of each fiber in the blends. Some theories have been introduced for color matching of blends of pre-colored fibers. Most however, are restricted in scope and accuracy. Kubelka and Munk presented the most applicable theory, which is still used in industry. In this work, the classical Kubelka-Munk method for color prediction of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005